3D topological quantum computing
نویسندگان
چکیده
In this paper we will present some ideas to use 3D topology for quantum computing extending from a previous paper. Topological used \textquotedblleft knotted\textquotedblright{} states of topological phases matter, called anyons. But anyons are connected with surface topology. surfaces have (usually) abelian fundamental groups and therefore one needs non-abelian it computing. usual materials objects which can admit more complicated topologies. Here, complements knots do play prominent role in principle the main parts understand 3-manifold For that purpose, construct system on knot 3-sphere (see arXiv:2102.04452 work). The whole is designed as knotted superconductor where every crossing Josephson junction qubit realized flux qubit. We discuss properties systems particular fluxion quantization by using A-polynomial knot. Furthermore showed 2-qubit operations be linked (knotted) superconductors again coupled via junction.
منابع مشابه
Topological Quantum Computing
Quantum computers have the ability to solve certain problems exponentially faster than the best known algorithms for classical computers. Examples include database searching, simulation of quantum systems, and factoring large numbers.[1][2][3] However, the nature of most quantum systems makes the states too fragile for efficient calculations to be done. Topological quantum computing avoids thes...
متن کاملMathematics of Topological Quantum Computing
In topological quantum computing, information is encoded in “knotted” quantum states of topological phases of matter, thus being locked into topology to prevent decay. Topological precision has been confirmed in quantum Hall liquids by experiments to an accuracy of 10−10 and harnessed to stabilize quantum memory. In this survey, we discuss the conceptual development of this interdisciplinary fi...
متن کاملTopological quantum computing with Read-Rezayi states.
Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which, in principle, can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with k>2, k not equal 4. This work exte...
متن کاملTopological Quantum Computing and the Jones Polynomial
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form e. This description is given with two objectives in mind. The first is to describe the algorithm in such a way as to make explicit the underlying and inherent control structure. The second is to make this alg...
متن کاملTopological quantum computing with only one mobile quasiparticle.
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2 + 1 dimensional space-time. In this Letter we show that any such quantum computation that can be done by braiding n identical quasiparticles can also be done by moving a single quasiparti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2021
ISSN: ['0219-7499', '1793-6918']
DOI: https://doi.org/10.1142/s0219749921410057